Compatible pointed pseudo-triangulations
نویسندگان
چکیده
For a given point set S (in general position), two pointed pseudo-triangulations are compatible if their union is plane. We show that for any set S there exist two maximally disjoint compatible pointed pseudotriangulations, that is, their union is a triangulation of S. In contrast, we show that there are point sets S and pointed pseudo-triangulations T such that there exists no pointed pseudo-triangulation that is compatible to and different from T .
منابع مشابه
On numbers of pseudo-triangulations
We study the maximum numbers of pseudo-triangulations and pointed pseudotriangulations that can be embedded over a specific set of points in the plane or contained in a specific triangulation. We derive the bounds O(5.45 ) and Ω(2.41 ) for the maximum number of pointed pseudo-triangulations that can be contained in a specific triangulation over a set of N points. For the number of all pseudo-tr...
متن کاملEnumerating pseudo-triangulations in the plane
A pseudo-triangle is a simple polygon with exactly three convex vertices. A pseudo-triangulation of a finite point set S in the plane is a partition of the convex hull of S into interior disjoint pseudo-triangles whose vertices are points of S. A pointed pseudo-triangulation is one which has the least number of pseudo-triangles. We study the graph G whose vertices represent the pointed pseudo-t...
متن کامل3-Colorability of Pseudo-Triangulations
Deciding 3-colorability for general plane graphs is known to be an NP-complete problem. However, for certain classes of plane graphs, like triangulations, polynomial time algorithms exist. We consider the family of pseudo-triangulations (a generalization of triangulations) and prove NP-completeness for this class. The complexity status does not change if the maximum face-degree is bounded to fo...
متن کاملCounting and Enumerating Pointed Pseudo-triangulations with the Greedy Flip Algorithm
This paper studies (pointed, or minimal) pseudotriangulations for a given point set in the plane. Pseudotriangulations have many properties of triangulations, and have more freedom since polygons with more than three vertices are allowed as long as exactly three have angles less than π. In particular, there is a natural flip operation on every internal edge. We establish fundamental properties ...
متن کاملInternational Journal of Computational Geometry & Applications
Deciding 3-colorability for general plane graphs is known to be an NP-complete problem. 31 However, for certain families of graphs, like triangulations, polynomial time algorithms 32 exist. We consider the family of pseudo-triangulations, which are a generalization of 33 triangulations, and prove NP-completeness for this class. This result also holds if we 34 bound their face degree to four, or...
متن کامل